Importance Sampling: Intrinsic Dimension and Computational Cost

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Importance Sampling: Intrinsic Dimension and Computational Cost

The basic idea of importance sampling is to use independent samples from a proposal measure in order to approximate expectations with respect to a target measure. It is key to understand how many samples are required in order to guarantee accurate approximations. Intuitively, some notion of distance between the target and the proposal should determine the computational cost of the method. A maj...

متن کامل

Importance Sampling: Computational Complexity and Intrinsic Dimension

Abstract: The basic idea of importance sampling is to use independent samples from one measure in order to approximate expectations with respect to another measure. Understanding how many samples are needed is key to understanding the computational complexity of the method, and hence to understanding when it will be effective and when it will not. It is intuitive that the size of the difference...

متن کامل

Gaussian Importance Sampling & Stratification : Computational Issues

This paper deals with efficient algorithms for simulating performance measures of Gaussian random vectors. Recently, we developed a simulation algorithm which consists of doing importance sampling by shifting the mean of the Gaussian random vector. Further variance reduction is obtained by stratification along a key direction. A central ingredient of this method is to compute the optimal shift ...

متن کامل

Efficient dynamic importance sampling of rare events in one dimension.

Exploiting stochastic path-integral theory, we obtain by simulation substantial gains in efficiency for the computation of reaction rates in one-dimensional, bistable, overdamped stochastic systems. Using a well-defined measure of efficiency, we compare implementations of "dynamic importance sampling" (DIMS) methods to unbiased simulation. The best DIMS algorithms are shown to increase efficien...

متن کامل

Cost-Driven Multiple Importance Sampling for Monte-Carlo Rendering

The global illumination or transport problems can also be considered as a sequence of integrals, while its MonteCarlo solutions as different sampling techniques. Multiple importance sampling takes advantage of different sampling strategies and combines the results obtained with them. In this paper we propose the combination of very different global illumination algorithms in a way that their st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical Science

سال: 2017

ISSN: 0883-4237

DOI: 10.1214/17-sts611